A penalty function method for computing chemical equilibria
نویسندگان
چکیده
منابع مشابه
A pathsearch damped Newton method for computing general equilibria
Computable general equilibrium models and other types of variational inequalities play a key role in computational economics. This paper describes the design and implementation of a pathsearch-damped Newton method for solving such problems. Our algorithm improves on the typical Newton method (which generates and solves a sequence of LCP's) in both speed and robustness. The underlying complement...
متن کاملFast Method for Computing Chemical Potentials and Liquid-Liquid Phase Equilibria of Macromolecular Solutions.
Chemical potential is a fundamental property for determining thermodynamic equilibria involving exchange of molecules, such as between two phases of molecular systems. Previously, we developed the fast Fourier transform (FFT)-based method for Modeling Atomistic Protein-crowder interactions (FMAP) to calculate excess chemical potentials according to the Widom insertion. Intermolecular interactio...
متن کاملA Modified Penalty Function Method for Inequality Constraints Minimization
In this paper we introduce a modified penalty function (MPF) method for solving a problem which minimizes a nonlinear programming subject to inequality constraints. Basically, this method is a combination of the modified penalty methods and the Lagrangian methods. It treats inequality constraints with a modified penalty function and avoids the indifferentiability of max {x, 0}. This method alte...
متن کاملA Penalty Function Method for Constrained Molecular Dynamics Simulation
We propose a penalty-function method for constrained molecular dynamics simulation by defining a quadratic penalty function for the constraints. The simulation with such a method can be done by using a conventional, unconstrained solver only with the penalty parameter increased in an appropriate manner as the simulation proceeds. More specifically, we scale the constraints with their force cons...
متن کاملA Penalty Function Method for Constrained Motion Planning
The path planning problem, i.e. the geometrical problem of finding a collision-free path between two given configurations of a robot moving among obstacles, has been studied by many authors in recent years. The interest in constrained motion planning is more recent. Constrained motion planning consists in finding motion sequences for robotic systems whose free space in not an open subset of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Geosciences
سال: 1990
ISSN: 0098-3004
DOI: 10.1016/0098-3004(90)90075-5